#include <iostream>
#include <cstdio>
#include "sort.h"
using namespace std;

class test
{
public:
    test (int n){
        p = new int[n];
        size = n;
        cout << "constructor"<<endl;
    };
    test (const test & t) {
        size = t.size;
        p = new int [size];
        cout << "copy constructor"<<endl;
    }
    virtual ~test (){
        delete [] p;
        cout << "Resource Released!"<<endl;
    }

private:
    int *p;
    int size;
};

int main(int argc, char *argv[])
{
    int a[] = {5,4,3,7,2,8,0,12,1};
    //int a[] = {2,1};
    int n = sizeof(a)/sizeof(a[0]);
    //sort s;
    //s.print(a, n);
    //s.heap_sort(a, n);
    //s.quick_sort(a, n);
    //s.select_sort(a, n);
    //s.insert_sort(a, n);
    //s.bubble_sort(a, n);

    while(cin>>n) {
        cout << n<< endl;
    }
    return 0;
}
